Pairwise Cardinality Networks
نویسندگان
چکیده
We introduce pairwise cardinality networks, networks of comparators, derived from pairwise sorting networks, which express cardinality constraints. We show that pairwise cardinality networks are superior to the cardinality networks introduced in previous work which are derived from odd-even sorting networks. Our presentation identifies the precise relationship between odd-even and pairwise sorting networks. This relationship also clarifies why pairwise sorting networks have significantly better propagation properties for the application of cardinality constraints.
منابع مشابه
Maximal subsets of pairwise non-commuting elements of some finite p-groups
Let G be a group. A subset X of G is a set of pairwise noncommuting elements if xy ̸= yx for any two distinct elements x and y in X. If |X| ≥ |Y | for any other set of pairwise non-commuting elements Y in G, then X is said to be a maximal subset of pairwise non-commuting elements. In this paper we determine the cardinality of a maximal subset of pairwise non-commuting elements in any non-abelian...
متن کاملSmaller Selection Networks for Cardinality Constraints Encoding
Selection comparator networks have been studied for many years. Recently, they have been successfully applied to encode cardinality constraints for SAT-solvers. To decrease the size of generated formula there is a need for constructions of selection networks that can be efficiently generated and produce networks of small sizes for the practical range of their two parameters: n – the number of i...
متن کاملEncoding Cardinality Constraints using Generalized Selection Networks
Boolean cardinality constraints state that at most (at least, or exactly) k out of n propositional literals can be true. We propose a new class of selection networks that can be used for an efficient encoding of them. Several comparator networks have been proposed recently for encoding cardinality constraints and experiments have proved their efficiency. Those were based mainly on the odd-even ...
متن کاملArcs Intersecting at Most Once
We prove that on a punctured oriented surface with Euler characteristic χ < 0, the maximal cardinality of a set of essential simple arcs that are pairwise nonhomotopic and intersecting at most once is 2|χ|(|χ|+1). This gives a cubic estimate in |χ| for a set of curves pairwise intersecting at most once on a closed surface. We also give polynomial estimates in |χ| for sets of arcs and curves pai...
متن کاملAn Improved Bound on the Cardinality of the Minimal Pairwise Balanced Designs on 18 Points with Maximum Block Size 4
The cardinality of the minimal pairwise balanced designs on v elements with largest block size k is denoted by g(k)(v). It is known that 31 ≤ g(4)(18) ≤ 33. In this paper we show that g(4)(18) 6= 31.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010